Nondeterministic finite automaton

Results: 144



#Item
71Theoretical computer science / Mathematics / Coding theory / Discrete mathematics / Nondeterministic finite automaton / Levenshtein distance / Hamming distance / String / Finite state transducer / Automata theory / Formal languages / Models of computation

IAENG International Journal of Computer Science, 36:2, IJCS_36_2_05 ______________________________________________________________________________________ Finite Automata Approach to Computing All Seeds of Strings with t

Add to Reading List

Source URL: www.iaeng.org

Language: English - Date: 2009-05-20 16:44:06
72Applied mathematics / Deterministic finite automaton / Nondeterministic finite automaton / Finite-state machine / Regular expression / Deterministic automaton / String searching algorithm / Powerset construction / Regular language / Automata theory / Theoretical computer science / Computer science

NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions Ville Laurikari Helsinki University of Technology Laboratory of Computer Science PL 9700, 02015 TKK, Finland

Add to Reading List

Source URL: laurikari.net

Language: English - Date: 2010-10-05 00:07:21
73Computer science / Applied mathematics / Deterministic pushdown automaton / Pushdown automaton / Nondeterministic finite automaton / Tree automaton / Deterministic finite automaton / Finite-state machine / Tree traversal / Automata theory / Models of computation / Theoretical computer science

Proceedings of the International Multiconference on Computer Science and Information Technology pp. 659–666 ISBN[removed]4 ISSN[removed]

Add to Reading List

Source URL: www.proceedings2009.imcsit.org

Language: English - Date: 2009-10-30 02:36:35
74Models of computation / Computer science / Applied mathematics / Deterministic finite automaton / Regular expression / Finite-state machine / Regular language / Nondeterministic finite automaton / String searching algorithm / Automata theory / Formal languages / Theoretical computer science

Efficient submatch addressing for regular expressions Master’s Thesis Ville Laurikari

Add to Reading List

Source URL: laurikari.net

Language: English - Date: 2010-10-05 00:06:57
75Formal languages / Computer science / Pattern matching / Universal identifiers / Nondeterministic finite automaton / Deterministic automaton / Terminal and nonterminal symbols / Deterministic finite automaton / International Article Number / Automata theory / Models of computation / Theoretical computer science

Data Structures in Coco/R Hanspeter Mössenböck Johannes Kepler University Linz Institute of System Software April 2005 This technical note describes the data structures in the C# and Java implementations

Add to Reading List

Source URL: www.ssw.uni-linz.ac.at

Language: English - Date: 2005-04-26 10:03:24
76Formal methods / Computer science / Linear temporal logic / Deterministic finite automaton / Nondeterministic finite automaton / Symbol / Model theory / Automata theory / Models of computation / Theoretical computer science

Monitoring of real-time properties Andreas Bauer, Martin Leucker, and Christian Schallhart Institut f¨ur Informatik, Technische Universit¨at M¨unchen Abstract. This paper presents a construction for runtime monitors t

Add to Reading List

Source URL: www.immerundewig.at

Language: English - Date: 2012-10-30 05:38:28
77Theoretical computer science / Formal languages / Computer science / Pushdown automaton / Deterministic pushdown automaton / Nondeterministic finite automaton / Deterministic finite automaton / Stack / Chomsky hierarchy / Automata theory / Theory of computation / Models of computation

Efficient Solutions for the Complement of wwR and the Complement of ww Allaoua Refoufi Computer Science Department University of Sétif Algéria

Add to Reading List

Source URL: dline.info

Language: English - Date: 2015-01-12 10:33:13
78Deterministic finite automaton / Finite-state machine / Nondeterministic finite automaton / Regular expression / Alphabet / Büchi automaton / Automata theory / Theory of computation / Theoretical computer science

RE-Tree: An Efficient Index Structure for Regular Expressions Chee-Yong Chan, Minos Garofalakis, Rajeev Rastogi Bell Labs, Lucent Technologies cychan,minos,rastogi @research.bell-labs.com 

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2006-07-29 02:03:00
79Formal languages / Computer science / Applied mathematics / Linear temporal logic / Temporal logic / Ω-automaton / Deterministic finite automaton / Nondeterministic finite automaton / Model theory / Automata theory / Theoretical computer science / Models of computation

TUM ¨ R INFORMATIK INSTITUT FU Runtime verification revisited Oliver Arafat, Andreas Bauer, Martin Leucker, Christian

Add to Reading List

Source URL: www.immerundewig.at

Language: English - Date: 2012-10-30 05:38:37
80Models of computation / Computer science / Combinatorics / Combinatorics on words / Nondeterministic finite automaton / Regular expressions / Deterministic finite automaton / String searching algorithm / Regular language / Automata theory / Formal languages / Theoretical computer science

New Techniques for Regular Expression Searching Gonzalo Navarro† ∗ Mathieu Raffinot‡

Add to Reading List

Source URL: www.dcc.uchile.cl

Language: English - Date: 2008-08-14 13:15:26
UPDATE